Avoidance of multicast incapable branching nodes for multicast routing in WDM networks
نویسندگان
چکیده
منابع مشابه
A Survey on Multicast Routing Approaches in Wireless Mesh Networks
Wireless mesh networks (WMNs) which mediates the broadband Internet access, have been recently received many attentions by the researchers. In order to increase capacity in these networks, nodes are equipped with multiple radios tuned on multiple channels emerging multi radio multi-channel WMNs (MRMC WMNs). Therefore, a vital challenge that poses in MRMC WMNs is how to properly assign channels ...
متن کاملOptimal Lightpath Routing in WDM Multicast Networks
In this paper, we propose a heuristic multicast routing algorithm, which minimizes the cost while satisfying both the wavelength required and hop length selection. The algorithm consists of two subproblems: the wavelength assignment & the routing path selection. For solving the wavelength assignment subproblem, an auxiliary graph is created where by the nodes and the links in the original netwo...
متن کاملRouting and wavelength assignment for WDM multicast networks
The multicast routing and wavelength assignment (MC-RWA) problem is generally studied with the objective to maximize the number of multicast groups admitted, or equivalently, to minimize the call (or session) blocking probability given a certain number of wavelengths. While this approach is sound, a better objective is to maximize the total number of users served (i.e., minimizing the user bloc...
متن کاملOptimal Multicast Routing Using Genetic Algorithm for WDM Optical Networks
We consider the multicast routing problem for large-scale wavelength division multiplexing (WDM) optical networks where transmission requests are established by point-to-multipoint connections. To realize multicast routing in WDM optical networks, some nodes need to have light (optical) splitting capability. A node with splitting capability can forward an incoming message to more than one outpu...
متن کاملMulticast Routing in GMPLS Networks with Unequal Branching Capability
In this letter, we study dynamic multicasting in GMPLS networks with unequal branching capability. An overlapped multicasting tree is proposed to reduce blocking probability, which can utilize the branching capabilities more efficiently than the traditional Steiner tree. A nearest node branch first heuristic is developed to find such an overlapped tree. key words: routing, multicast, branching ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Photonic Network Communications
سال: 2009
ISSN: 1387-974X,1572-8188
DOI: 10.1007/s11107-009-0200-3